On a family of Halley-like methods to find simple roots of nonlinear equations

نویسندگان

  • Beny Neta
  • Melvin Scott
چکیده

Keywords: Basin of attraction Simple roots Nonlinear equations Halley method Euler–Chebyshev method a b s t r a c t There are many methods for solving a nonlinear algebraic equation. Here we introduce a family of Halley-like methods and show that Euler–Chebyshev and BSC are just members of the family. We discuss the conjugacy maps and the effect of the extraneous roots on the basins of attraction. Published by Elsevier Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Dynamics of a Family of Third-order Iterative Functions

We study the dynamics of a family of third-order iterative methods that are used to find roots of nonlinear equations applied to complex polynomials of degrees three and four. This family includes, as particular cases, the Chebyshev, the Halley and the super-Halley root-finding algorithms, as well as the so-called c-methods. The conjugacy classes of these iterative methods are found explicitly....

متن کامل

A family of third-order methods to solve nonlinear equations by quadratic curves approximation

A one-parameter family of iteration functions for finding the simple roots of nonlinear equations is presented. The iteration process is based on one-point approximation by the quadratic equation x + ay + bx + cy + d = 0, where the unknowns b, c and d are determined in terms of a. Different choices of a correspond to different approximating quadratic curves, viz. parabola, circle, ellipse and h...

متن کامل

A modification of Chebyshev-Halley method free from second derivatives for nonlinear equations

‎In this paper‎, ‎we present a new modification of Chebyshev-Halley‎ ‎method‎, ‎free from second derivatives‎, ‎to solve nonlinear equations‎. ‎The convergence analysis shows that our modification is third-order‎ ‎convergent‎. ‎Every iteration of this method requires one function and‎ ‎two first derivative evaluations‎. ‎So‎, ‎its efficiency index is‎ ‎$3^{1/3}=1.442$ that is better than that o...

متن کامل

Dynamical ‎C‎ontrol of Computations Using the Family of Optimal Two-point Methods to Solve Nonlinear ‎Equations

One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...

متن کامل

A new optimal method of fourth-order convergence for solving nonlinear equations

In this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable Taylor and weight function approximation. The method is based on Weerakoon-Fernando method [S. Weerakoon, G.I. Fernando, A variant of Newton's method with third-order convergence, Appl. Math. Lett. 17 (2000) 87-93]. The method is optimal, as it needs three evaluations per iterate,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 219  شماره 

صفحات  -

تاریخ انتشار 2013